Hermitian matrices of three parameters: perturbing coalescing eigenvalues and a numerical method
نویسندگان
چکیده
In this work we consider Hermitian matrix valued functions of 3 (real) parameters, and are interested in generic coalescing points of eigenvalues, conical intersections. Unlike our previous works [7, 4], where we worked directly with the Hermitian problem and monitored variation of the geometric phase to detect conical intersections inside a sphere-like region, here we consider the following construction: (i) Associate to the given problem a real symmetric problem, twice the size, all of whose eigenvalues are now (at least) double, (ii) perturb this enlarged problem so that –generically– each pair of consecutive eigenvalues coalesce along curves, and only there, (iii) analyze the structure of these curves, and show that there is a small curve, nearly planar, enclosing the original conical intersection point. We will rigorously justify all of the above steps. Furthermore, we propose and implement an algorithm following the above approach, and illustrate its performance in locating conical intersections. Notation. Below, Ω ⊂ R3 indicates an open region of R3 diffeomorphic to the open unit ball; ξ = (α, β, γ) ∈ Ω will indicate a general point in Ω. The metric is the Euclidean metric. We write A ∈ Ck(Ω,Cn×n), k ≥ 1, to indicate a smooth complex matrix-valued function defined on Ω and further A ∈ Cω if the dependence on parameter(s) is analytic. We write A∗ for the conjugate transpose of a matrix A, and have A = A∗ for a Hermitian matrix. The word Hermitian will imply complex valued entries. Similarly, the word symmetric will be restricted to matrices with real entries. With σ(A) we indicate the set of eigenvalues (repeated by multiplicity) of A.
منابع مشابه
Spectral properties of the preconditioned AHSS iteration method for generalized saddle point problems
In this paper, we study the distribution on the eigenvalues of the preconditioned matrices that arise in solving two-by-two block non-Hermitian positive semidefinite linear systems by use of the accelerated Hermitian and skew-Hermitian splitting iteration methods. According to theoretical analysis, we prove that all eigenvalues of the preconditioned matrices are very clustered with any positive...
متن کاملA mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملThe bounds of the eigenvalues for rank-one modification of Hermitian matrix
The eigenproblems of the rank-one updates of the matrices have lots of applications in scientific computation and engineering such as the symmetric tridiagonal eigenproblems by the divide-andconquer method and Web search engine. Many researchers have well studied the algorithms for computing eigenvalues of Hermitian matrices updated by a rank-one matrix [1–6]. Recently, Ding and Zhou studied a ...
متن کاملApproximating Coalescing Points for Eigenvalues of Hermitian Matrices of Three Parameters
We consider a Hermitian matrix valued function A(x) ∈ C, smoothly depending on parameters x ∈ Ω ⊂ R, where Ω is an open bounded region of R. We develop an algorithm to locate parameter values where the eigenvalues of A coalesce. We give theoretical justification and implementation details. Finally, we illustrate the technique on several problems. Notation. With A ∈ Cn×n we indicate an n×n compl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 84 شماره
صفحات -
تاریخ انتشار 2015